<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    19. Remove Nth Node From End of List
   </h1>
   <p>
    Given a linked list, remove the
    <em>
     n
    </em>
    -th node from the end of list and return its head.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
Given linked list: <strong>1-&gt;2-&gt;3-&gt;4-&gt;5</strong>, and <strong><em>n</em> = 2</strong>.

After removing the second node from the end, the linked list becomes <strong>1-&gt;2-&gt;3-&gt;5</strong>.
</pre>
   <p>
    <strong>
     Note:
    </strong>
   </p>
   <p>
    Given
    <em>
     n
    </em>
    will always be valid.
   </p>
   <p>
    <strong>
     Follow up:
    </strong>
   </p>
   <p>
    Could you do this in one pass?
   </p>
  </div>
  <div>
   <h1 class="question_title">
    19. 删除链表的倒数第N个节点
   </h1>
   <p>
    给定一个链表，删除链表的倒数第&nbsp;
    <em>
     n&nbsp;
    </em>
    个节点，并且返回链表的头结点。
   </p>
   <p>
    <strong>
     示例：
    </strong>
   </p>
   <pre>给定一个链表: <strong>1-&gt;2-&gt;3-&gt;4-&gt;5</strong>, 和 <strong><em>n</em> = 2</strong>.

当删除了倒数第二个节点后，链表变为 <strong>1-&gt;2-&gt;3-&gt;5</strong>.
</pre>
   <p>
    <strong>
     说明：
    </strong>
   </p>
   <p>
    给定的
    <em>
     n
    </em>
    &nbsp;保证是有效的。
   </p>
   <p>
    <strong>
     进阶：
    </strong>
   </p>
   <p>
    你能尝试使用一趟扫描实现吗？
   </p>
  </div>
 </body>
</html>